On complete degrees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Structure of Complete Degrees

The notion of NP-completeness has cut across many elds and has provided a means of identifying deep and unexpected commonalities. Problems from areas as diverse as combinatorics, logic, and operations research turn out to be NP-complete and thus computationally equivalent in the sense discussed in the next paragraph. PSPACE-completeness, NEXP-completeness, and completeness for other complexity ...

متن کامل

On the Topological Size of p-m-Complete Degrees

All polynomial many-one degrees are shown to be of second Baire category in the superset topology when witness functions are allowed to run in 2 log h n time, for any h. Any improvement of this result for the complete p-m-degrees of RE, EXP or NP implies P 6 = NP.

متن کامل

Complete Positivity and Entangled Degrees of Freedom

We study how some recently proposed noncontextuality tests based on quantum interferometry are affected if the test particles propagate as open systems in presence of a gaussian stochastic background. We show that physical consistency requires the resulting markovian dissipative time-evolution to be completely positive.

متن کامل

Pseudo-Random Generators and Structure of Complete Degrees

It is shown that if there exist sets in E that require -sized circuits then sets that are hard for class P, and above, under 1-1 reductions are also hard under 1-1, sizeincreasing reductions. Under the assumption of the hardness of solving RSA or Discrete Log problem, it is shown that sets that are hard for class NP, and above, under manyone reductions are also hard under (non-uniform) 1-1, and...

متن کامل

Random strings and tt-degrees of Turing complete C.E. sets

We investigate the truth-table degrees of (co-)c.e. sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table completeness depends on the choice of universal machine. We show that for such sets of random strings, any finite set of their truth-table degrees do not meet to the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences

سال: 1965

ISSN: 0386-2194

DOI: 10.3792/pja/1195522199